An extension of the polytope of doubly stochastic matrices
نویسندگان
چکیده
منابع مشابه
The polytope of even doubly stochastic matrices
The polytope Q, of the convex combinations of the permutation matrices of order n is well known (Birkhoff’s theorem) to be the polytope of doubly stochastic matrices of order n. In particular it is easy to decide whether a matrix of order n belongs to Q,. . check to see that the entries are nonnegative and that all row and columns sums equal 1. Now the permutations z of { 1, 2, . . . . n} are i...
متن کاملOn the Volume of the Polytope of Doubly Stochastic Matrices
We study the calculation of the volume of the polytope Bn of n × n doubly stochastic matrices; that is, the set of real non-negative matrices with all row and column sums equal to one. We describe two methods. The first involves a decomposition of the polytope into simplices. The second involves the enumeration of “magic squares”, i.e., n×n non-negative integer matrices whose rows and columns a...
متن کاملFormulas for the Volumes of the Polytope of Doubly-stochastic Matrices and Its Faces
We provide an explicit combinatorial formula for the volume of the polytope of n× n doubly-stochastic matrices, also known as the Birkhoff polytope. We do this through the description of a generating function for all the lattice points of the closely related polytope of n × n real non-negative matrices with all row and column sums equal to an integer t. We can in fact recover similar formulas f...
متن کاملMinimum permanents on two faces of the polytope of doubly stochastic matrices∗
We consider the minimum permanents and minimising matrices on the faces of the polytope of doubly stochastic matrices whose nonzero entries coincide with those of, respectively, Um,n = [ In Jn,m Jm,n 0m ] and Vm,n = [ In Jn,m Jm,n Jm,m ] . We conjecture that Vm,n is cohesive but not barycentric for 1 < n < m + √ m and that it is not cohesive for n > m + √ m. We prove that it is cohesive for 1 <...
متن کاملDoubly stochastic matrices of trees
In this paper, we obtain sharp upper and lower bounds for the smallest entries of doubly stochastic matrices of trees and characterize all extreme graphs which attain the bounds. We also present a counterexample to Merris’ conjecture on relations between the smallest entry of the doubly stochastic matrix and the algebraic connectivity of a graph in [R. Merris, Doubly stochastic graph matrices I...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear and Multilinear Algebra
سال: 2013
ISSN: 0308-1087,1563-5139
DOI: 10.1080/03081087.2012.689980